Papers with coreference resolution algorithm
They Exist! Introducing Plural Mentions to Coreference Resolution and Entity Linking (C18-1)
Copied to clipboard
| Challenge: | Unlike singular mentions each of which represents one entity, plural mentions stand for multiple entities. |
| Approach: | They propose a novel coreference resolution algorithm that selectively creates clusters to handle both singular and plural mentions and a deep learning-based entity linking model that jointly handles both types of mentions through multi-task learning. |
| Outcome: | The proposed model outperforms existing models designed for singular mentions and plural mentions. |
OpenEL: An Annotated Corpus for Entity Linking and Discourse in Open Domain Dialogue (2022.lrec-1)
Copied to clipboard
| Challenge: | Named entity recognition (NER), named entity linking and discourse modeling are crucial aspects of natural language understanding for open domain dialogue systems. |
| Approach: | They present an annotated multi-domain corpus for linking entities in open-domain dialogue . they use dialogue context and anaphora resolution to assess the effectiveness of the task . |
| Outcome: | The OpenEL corpus is an annotated multi-domain corpus for linking entities in open-domain dialogue . the system Flair + BLINK has the best performance with a 0.65 F1 score . |